Wireless Communication

M. Pushpavalli ¹, E. Dinesh ², A. M. Natarajan ³

Affiliations
1 Department of Electronics and Communication Engineering, Bannari Amman Institute of Technology, Sathyamangalam, IN
2 Department of Applied Electronics, Bannari Amman Institute of Technology, Sathyamangalam, IN
3 Bannari Amman Institute of Technology, Sathyamangalam, IN

Abstract

An attractive mobile ad-hoc network is the collection of mobile nodes that can communicate among themselves within multi-hop with no infrastructure between them. MANET has issues like limited resources, mobility, limited and shared bandwidth. Hence routing becomes difficult and the requirement of QoS raised numerous challenging issues in MANETs. The QoS is not satisfied due to NP complete problem. Hence to satisfy these network constraints we introduce a novel method to find the feasible path that has sufficient resources. Our method includes a multi-objective genetic algorithm and it optimizes parameters like delay and bandwidth. For optimizing we use the QoS aware routing protocol as OLSR considering its MPR sets to find path between source and destination. By using this optimization technique the congestion in the network is minimized and packet delivery ratio is improved.

Keywords

GA, OLSR Protocol, MPR Selection Algorithm, Delay and Bandwidth.

Full Text

     

N. Premalatha ¹, A. M. Natarajan ²

Affiliations
1 Department of Computer Science and Engineering, Kongu Engineering College, Perundurai, IN
2 Bannari Amman Institute of Technology, Sathyamangalam, IN

Abstract

A medium access control (MAC) protocol decides when competing nodes may access the radio channel, and tries to ensure that no two nodes are interfering with each other’s transmissions. In this paper we propose a QoS model for wireless ad hoc networks. Unlike other models it provides stochastic end to end delay guarantees using a routing protocol called GPSR (Greedy Perimeter Stateless Routing) protocol. After the routing is over the packets transmission is done through CTMAC (Concurrent Transmission MAC) protocol with fragmentation. The packets are transmitted concurrently where concurrent transmission is possible. CTMAC inserts additional control gap between the transmission of control packets (RTS/CTS) and data packets (DATA/ACK), which allows a series of RTS/CTS exchanges to take place between the nodes in the vicinity of the transmitting, or receiving node to schedule possible multiple, concurrent data transmissions. It completely utilizes the channel bandwidth and increase the fairness of each flow without causing congestion. This increases the throughput. The results shows us that the throughput of QoS model, where network flow is identified using GPSR protocol and packets are transmitted through CTMAC protocol with fragmentation, is increased when compared with the throughput of CTMAC protocol alone.

Keywords

Wireless, Congestion Control, MAC Protocol, QOS Enhancement, Fragmentation, CTMAC Protocol, Throughput, GPSR.

Full Text

     

C. Poongodi ¹, A. M. Natarajan ², R. C. Suganthe ³

Affiliations
1 Department of Information Technology, Kongu Engineering College, Perundurai, IN
2 Department of Electronics and Communication Engineering, Bannari Amman Institute of Technology, IN
3 Computer Science Engineering Department, Kongu Engineering College, IN

Abstract

In challenging network scenarios like battlefield and disaster recovery scenarios, nodes suffer from frequent network partitions and intermittent connectivity. In these scenarios instantaneous end-to-end path between the sender and receiver will not exist due to link breakdown, less battery or mobility of nodes. To address these challenges in challenged networks, DTN architecture with store and forward mechanism is already proposed. But, the existing routing protocols proposed for DTN fails to address the bundle forwarding when a node is out its own network. Therefore the delay in message delivery increases further. Also it lacks for centralized control and scalability problems. Here we propose, an enhanced bundle delivery routing protocol with cluster head for DTN to address the above issues.

Keywords

Bundle, Challenged Networks, Delay Tolerant Networks, Name Tuple, Message Switching.

Full Text

     

S. Varadhaganapathy ¹, A. M. Natarajan ²

Affiliations
1 Department of Information Technology, Kongu Engineering College, Perundurai, Erode, Tamilnadu,, IN
2 Bannari Amman Institute of Technology, Sathyamangalam, Tamilnadu, IN

Abstract

An Ad hoc network is a collection of wireless computers (nodes) communicating among themselves over multi-hop paths. Also it is an infrastructure-less network which has dynamic topology, organized by itself and can be easily deployed with minimum configuration. These are the constraints which draw the attention and importance of ad hoc networks in defense applications. In recent years, security in ad hoc networks becomes an exiting and interesting research topic that has started to receive attention from a number of researchers. Several routing protocols for ad hoc networks have been proposed, but most of them failed to consider the security problem. In this paper, Triple Hash Technique (THT) has been implemented to protect the routing information. The security associations between source node and destination node and also between the nodes are established, when they are in the coverage area of each other, by exchanging appropriate information. This security mechanism is based on Ad hoc On-demand Distance Vector (AODV) routing protocol for ad hoc networks. The results show that in a mobile adhoc network, the Triple Hash Technique provides secure routing even in the presence of malicious nodes.

Keywords

Ad Hoc Network, AODV, Authentication, Triple Hash Technique.

Full Text